Computing the vertex separation of unicyclic graphs
نویسندگان
چکیده
منابع مشابه
Computing the vertex separation of unicyclic graphs
We describe an O(n log n) algorithm for the computation of the vertex separation of unicyclic graphs. The algorithm also computes a linear layout with optimal vertex separation in the same time bound. Pathwidth, node search number and vertex separation are different ways of defining the same notion. Path decompositions and search strategies can be derived from linear layouts. The algorithm appl...
متن کاملOn the vertex separation of unicyclic graphs
In the article “Computing the vertex separation of unicyclic graphs”, Information and Computation 192, pp. 123–161, 2004, Ellis et al. proposed an O(n log n) algorithm for computing both the vertex separation and an optimal layout of a unicyclic graph with n vertices. Using the data structures label and label array, we improve the time complexity of their algorithm to O(n).
متن کاملTotal Vertex Irregularity Strength of Certain Classes of Unicyclic Graphs *
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, . . . , k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x. The minimum k for which the graph G...
متن کاملOn arbitraly vertex decomposable unicyclic graphs with dominating cycle
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n1, . . . , nk) of positive integers such that ∑k i=1 ni = n, there exists a partition (V1, . . . , Vk) of vertex set of G such that for every i ∈ {1, . . . , k} the set Vi induces a connected subgraph of G on ni vertices. We consider arbitrarily vertex decomposable unicyclic graphs with dominating cycle. We al...
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2004
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.03.005